Graded Many-Valued Modal Logic and Its Graded Rough Truth
نویسندگان
چکیده
Much attention is focused on the relationship between rough sets and many-valued modal logic to deal with approximate reasoning. This paper discusses graded puts forward G(S5). Secondly, by employing operators that correspond operations in G(S5), we introduce concept of upper lower truth degrees a logical formula. Then, propose conditional degrees. Several basic interesting properties are addressed. Finally, order make distinction any two formulas logic, similarity established very natural way.
منابع مشابه
An Infinitary Graded Modal Logic (Graded Modalities VI)
We prove a completeness theorem for K:l, the infinitary extension of the graded version K O of the minimal normal logic K , allowing conjunctions and disjunctions of countable sets of formulas. This goal is achieved using both the usual tools of the normal logics with graded modalities and the machinery of the predicate infinitary logics in a version adapted to modal logic. Mathematics Subject ...
متن کاملRelative Truth Degree of Logic Formulas and Graded Fuzzy Logic
The concept of logic proposition induced functions is proposed in the present paper, then the concept of relative truth degree of propositions with respect to a logic theory Γ is introduced by means of infinite product of evenly distributed probability spaces and integrated semantics respectively w.r.t. discrete and continuous situations, and a graded approximate reasoning theory is established...
متن کاملA PSpace Algorithm for Graded Modal Logic
We present a PSpace algorithm that decides satisfiability of the graded modal logic Gr(KR)—a natural extension of propositional modal logic KR by counting expressions—which plays an important role in the area of knowledge representation. The algorithm employs a tableaux approach and is the first known algorithm which meets the lower bound for the complexity of the problem. Thus, we exactly fix ...
متن کاملA Note on Graded Modal Logic
We introduce a notion of bisimulation for graded modal logic. Using these bisimulations the model theory of graded modal logic can be developed in a uniform manner. We illustrate this by establishing the finite model property, and proving invariance and definability results.
متن کاملTableaus for many-valued modal logic
We continue a series of papers on a family of many-valued modal logics, a family whose Kripke semantics involves many-valued accessibility relations. Earlier papers in the series presented a motivation in terms of a multiple-expert semantics. They also proved completeness of sequent calculus formulations for the logics, formulations using a cut rule in an essential way. In this paper a novel cu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Axioms
سال: 2022
ISSN: ['2075-1680']
DOI: https://doi.org/10.3390/axioms11070341